Approximation algorithms is a subfield of theoretical computer science and operations research focused on the design and analysis of efficient algorithms that find near-optimal solutions for computationally intractable problems. This research area investigates methods to provide provable performance guarantees, bounding the quality of the approximate solution relative to the true optimum within polynomial time.